Arc-Typed Petri Nets
نویسندگان
چکیده
We formally introduce arc-typed nets as a model for causality based speciica-tions. The new feature of arc-typed nets is the distinction of diierent arc-types; the diierent arc-types carry over to a process of the net. Therefore, there are diierent types of causalities in a run of an arc-typed net. Arc-typed nets have informally been used for modelling and verifying consistency protocols. It turned out that arc-typed nets provide an adequate level of abstraction for these kind of applications. We demonstrate the application of arc-typed nets by specifying, modelling, and verifying a simple consistency protocol.
منابع مشابه
Decidable Classes of Unbounded Petri Nets with Time and Urgency
Adding real time information to Petri net models often leads to undecidability of classical verification problems such as reachability and boundedness. For instance, models such as Timed-Transition Petri nets (TPNs) [22] are intractable except in a bounded setting. On the other hand, the model of TimedArc Petri nets [26] enjoys decidability results for boundedness and control-state reachability...
متن کاملRelationships between Petri Nets and Constraint Graphs: Application to Manufacturing
The purpose of the paper is to compare timed and time Petri nets with constraint satisfaction problems and activity-on-arc graphs in the context of manufacturing. It is shown that constraints are not defined in the same way but that timed and time Petri nets could be translated into a set of activity-on-arc graphs. This translation is only straightforward for p-timed and p-time Petri nets.
متن کاملAn Efficient Translation of Timed-Arc Petri Nets to Networks of Timed Automata
Bounded timed-arc Petri nets with read-arcs were recently proven equivalent to networks of timed automata, though the Petri net model cannot express urgent behaviour and the described mutual translations are rather inefficient. We propose an extension of timed-arc Petri nets with invariants to enforce urgency and with transport arcs to generalise the read-arcs. We also describe a novel translat...
متن کاملTimed-Arc Petri Nets vs. Networks of Timed Automata
We establish mutual translations between the classes of 1safe timed-arc Petri nets (and its extension with testing arcs) and networks of timed automata (and its subclass where every clock used in the guard has to be reset). The presented translations are very tight (up to isomorphism of labelled transition systems with time). This provides a convenient characterization from the theoretical poin...
متن کاملAn Algebra of Timed-Arc Petri Nets
In this paper we present and investigate two algebras, one based on term re-writing and the other on Petri nets, aimed at the specification and analysis of concurrent systems with timing information. The former is based on process expressions (at-expressions) and employs a set of SOS rules providing their operational semantics. The latter is based on a class of Petri nets with time restrictions...
متن کامل